A tournament problem
نویسندگان
چکیده
منابع مشابه
Tournament Searching Method to Feature Selection Problem
A new search method to the feature selection problem – the tournament searching – is proposed and compared with other popular feature selection methods. The tournament feature selection method is a simple stochastic searching method with only one parameter controlling the global-local searching properties of the algorithm. It is less complicated and easier to use than other stochastic methods, ...
متن کاملThe Linear Distance Traveling Tournament Problem
We introduce a linear distance relaxation of the nteam Traveling Tournament Problem (TTP), a simple yet powerful heuristic that temporarily “assumes” the n teams are located on a straight line, thereby reducing the ( n 2 ) pairwise distance parameters to just n − 1 variables. The modified problem then becomes easier to analyze, from which we determine an approximate solution for the actual inst...
متن کاملThe traveling tournament problem with predefined venues
Sports scheduling is a very attractive application area not only because of the interesting mathematical structures of the problems, but also due to their importance in practice and to the big business that sports have become. In this paper, we introduce the Traveling Tournament Problem with Predefined Venues, which consists in scheduling a compact single round robin tournament with a predefine...
متن کاملMirrored Traveling Tournament Problem: An Evolutionary Approach
The Mirrored Traveling Tournament Problem (mTTP) is an optimization problem that represents certain types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of hybrid heuristic to solve the mTTP, using an evolutionary algorithm in association with the metaheuristic Simulated Annealing. It suggests the use of Genetic Alg...
متن کاملHeuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poor schedules of games. Game scheduling is a difficult task, involving several decision makers, different types of constraints, and multiple objectives to optimize. The Traveling Tournament Problem abstracts certain type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1983
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000002927